On the clique number of noisy random geometric graphs

Let G n $$ {G}_n be a random geometric graph, and then for q , p ∈ [ 0 1 ) q,p\in \left[0,1\right) we construct ( \left(q,p\right) -perturbed noisy graph {G}_n^{q,p} where each existing edge in is removed with probability while non-existent inserted . We give asymptotically tight bounds on the clique number ω \omega \left({G}_n^{q,p}\right) several regimes of parameter.